Intervals of Permutation Class Growth Rates
نویسندگان
چکیده
منابع مشابه
Intervals of Permutation Class Growth Rates
We prove that the set of growth rates of permutation classes includes an infinite sequence of intervals whose infimum is θB ≈ 2.35526, and that it also contains every value at least λB ≈ 2.35698. These results improve on a theorem of Vatter, who determined that there are permutation classes of every growth rate at least λA ≈ 2.48187. Thus, we also refute his conjecture that the set of growth ra...
متن کاملOn Growth Rates of Closed Permutation Classes
A class of permutations Π is called closed if π ⊂ σ ∈ Π implies π ∈ Π, where the relation ⊂ is the natural containment of permutations. Let Πn be the set of all permutations of 1, 2, . . . , n belonging to Π. We investigate the counting functions n 7→ |Πn| of closed classes. Our main result says that if |Πn| < 2n−1 for at least one n ≥ 1, then there is a unique k ≥ 1 such that Fn,k ≤ |Πn| ≤ Fn,...
متن کاملOn growth rates of hereditary permutation classes
A class of permutations is called hereditary if implies where the relation is the natural containment of permutations Let n be the set of all permutations of n belonging to We investigate the counting functions n j nj of hereditary classes Our main result says that if j nj n for at least one n then there is a unique k such that Fn k j nj Fn k n c holds for all n with a constant c Here Fn k are ...
متن کاملPermutation estimation and minimax rates of identifiability
The problem of matching two sets of features appears in various tasks of computer vision and can be often formalized as a problem of permutation estimation. We address this problem from a statistical point of view and provide a theoretical analysis of the accuracy of several natural estimators. To this end, the notion of the minimax rate of identifiability is introduced and its expression is ob...
متن کاملA Class of Binomial Permutation Polynomials
For a prime power q, let Fq be the finite field with q elements and F ∗ q denote its multiplicative group. A polynomial f ∈ Fq[x] is called a permutation polynomial (PP) if its associated polynomial mapping f : c 7→ f(c) from Fq to itself is a bijection. A permutation polynomial f(x) is referred to as a complete permutation polynomial (CPP) if f(x)+x is also a permutation over Fq [4]. Permutati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2017
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-016-3349-2